Aproximating the Well-Founded Semantics for Normal Logic Programs using Abstract Interpretation
نویسندگان
چکیده
The well-founded semantics for normal logic programs is deened in a constructive way through the use of a xpoint operator and in general is not computable. We propose an approach for approximating through abstract interpretation the concrete behavior of normal logic programs described by the well-founded semantics. We provide also an abstract well-founded semantics scheme, based on an abstract immediate consequences operator and apply this scheme to obtain an approximated semantics on the depth(k) domain.
منابع مشابه
A Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms
Logic programs with abstract constraint atoms proposed by Marek and Truszczynski are very general logic programs. They are general enough to capture aggregate logic programs as well as recently proposed description logic programs. In this paper, we propose a wellfounded semantics for basic logic programs with arbitrary abstract constraint atoms, which are sets of rules whose heads have exactly ...
متن کاملExtended Well-Founded Semantics for Paraconsistent Logic Programs
This paper presents a declarative semantics of logic programs which possibly contain inconsistent information. We introduce a multi-valued interpretation of logic programs and present the extended well-founded semantics for paraconsistent logic programs. In this setting, a meaningful information is still available in the presence of an inconsistent information in a program and any fact which is...
متن کاملThe Well-Founded Semantics of Cyclic Probabilistic Logic Programs: Meaning and Complexity
This paper investigates the properties of cyclic probabilistic normal logic programs, consisting of rules and a set of independent probabilistic facts, under the well-founded semantics. That is, we assume that for each fixed truth assignment for the probabilistic facts, the resulting normal logic program is interpreted through the well-founded semantics. We derive results concerning the complex...
متن کاملComputing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms
The well-founded semantics of logic programs is not only an important semantics but also serves as an essential tool for program simplification in answer set computations. Recently, it has been shown that for normal and disjunctive programs, the well-founded models can be computed by unit propagation on program completion and loop formulas of loops with no external support. An attractive featur...
متن کاملStable Semantics for Disjunctive Programs
[VG89b] A. Van Gelder. Negation as failure using tight derivations for general logic programs. [Prz91c] T. C. Przymusinski. Three-valued non-monotonic formalisms and semantics of logic programs. Journal of Articial Intelligence, 1991. (In print. Extended abstract appeared in: T. C. Przy-musinski. Three-valued non-monotonic formalisms and logic programming. [Ros89b] K. Ross. The well founded sem...
متن کامل